Optimal Longest Paths by Dynamic Programming
نویسندگان
چکیده
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that have previously been unsolved. 1998 ACM Subject Classification G.2.2 Graph Theory
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملThe Optimal Allocation of Iran's Natural Gas
T he optimal allocation of natural gas resources to various uses such as final and intermediate consumption, injection into oil fields, and exports can help policymakers to use this kind of resources efficiently. Empirical evidence support using hyperbolic discount rates instead of fixed discount rates in the economic literature. The purpose of this study is to maximize the social we...
متن کاملAn Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach
Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...
متن کاملA Comparative Study of Different Longest Common Subsequence Algorithms
The longest common subsequence is a classical problem which is solved by using the dynamic programming approach. The LCS problem has an optimal substructure: the problem can be broken down into smaller, simple "subproblems", which can be broken down into yet simpler subproblems, and so on, until, finally, the solution becomes trivial. The LCS problem also has overlapping subproblems: the soluti...
متن کاملطراحی و تعقیب مسیر رباتهای زیرسطحی در محیطهای دینامیک با استفاده از روشهای حل تبدیل هوشمند و کلاسیک
In this paper, first a sample Autonomous Underwater Vehicle called NEROV from the University of Trondheim of Norway has been selected with its equations of motion and by using dynamic programming approach optimal paths for consuming energy have been designed. There are moving obstacles in the environment wherein the robot moves. It is seen that the planned paths is smooth and the energy used fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.04170 شماره
صفحات -
تاریخ انتشار 2017